Worst-case groundness analysis using definite Boolean functions

Worst-case groundness analysis using definite boolean functions

This note illustrates theoretical worst-case scenarios for groundness analyses obtained through abstract interpretation over the abstract domains of definite (Def) and positive (Pos) Boolean functions. For Def, an example is given for which any Def-based abstract interpretation for groundness analysis follows a chain which is exponential in the number of argument positions as well as in the num...

Worst-Case Groundness Analysis Using Positive Boolean Functions

This note illustrates a theoretical worst-case scenario for groundness analyses obtained through abstract interpretation over the abstract domain of positive Boolean functions. A sequence of programs is given for which any P os-based abstract interpretation for groundness analysis follows an exponential chain. Another sequence of programs is given for which a state-of-the-art implementation bas...

Implementing Groundness Analysis with Definite Boolean Functions

The domain of deenite Boolean functions, Def , can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs. In this paper, previously unexploited computational properties of Def are utilised to develop an eecient and succinct groundness analyser that can be coded in Prolog. In particular, entailment checking is used to pre...

Analysis of Boolean Functions

Scribe notes from the 2012 Barbados Workshop on Computational Complexity. A series of lectures on Analysis of Boolean Functions by Ryan O'Donnell, with a guest lecture by Per Austrin.

Analysis of Boolean Functions